#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=7e3+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],b[maxn];
map<LL,LL>map1;
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   for(LL i=1;i<=n;i++) cin>>a[i],map1[a[i]]++;
   for(LL i=1;i<=n;i++) cin>>b[i];
   if(n==1){
      cout<<"0"<<"\n";
      return 0;
   }
   LL sum=0;
   vector<LL>val;
   for(LL i=1;i<=n;i++){
       if(map1[a[i]]>=2){
          val.push_back(a[i]);
          sum+=b[i];
       }
   }
   for(LL i=1;i<=n;i++){
       if(map1[a[i]]<2){
          LL res=0;
          for(LL j=0;j<val.size();j++){
             if( (val[j]|a[i])!=val[j]){
                  res++;
              }
          }
          if(res!=val.size()){
             sum+=b[i];
             val.push_back(a[i]);
          }
       }
   }
   cout<<sum<<"\n";
   return 0;
}
